翻訳と辞書
Words near each other
・ Quincy-sous-le-Mont
・ Quincy-sous-Sénart
・ Quincy-Voisins
・ Quindalup, Western Australia
・ Quindanning, Western Australia
・ Quindar tones
・ Quindaro Townsite
・ Quindecimviri sacris faciundis
・ Quindici
・ Quindim
・ Quindocqua United Methodist Church
・ Quindon Tarver
・ Quindío Department
・ Quindío River
・ Quine
Quine (computing)
・ Quine (surname)
・ Quine's paradox
・ Quinebaug and Shetucket Rivers Valley National Heritage Corridor
・ Quinebaug Highlands
・ Quinebaug Lake State Park
・ Quinebaug Mill – Quebec Square Historic District
・ Quinebaug River
・ Quinebaug River Prehistoric Archeological District
・ Quinebaug Trail
・ Quinebaug Valley Community College
・ Quinebaug Woods
・ Quinebaug, Connecticut
・ Quinella
・ Quinella (album)


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Quine (computing) : ウィキペディア英語版
Quine (computing)

A quine is a non-empty computer program which takes no input and produces a copy of its own source code as its only output. The standard terms for these programs in the computability theory and computer science literature are "self-replicating programs", "self-reproducing programs", and "self-copying programs".
A quine is a fixed point of an execution environment, when the execution environment is viewed as a function. Quines are possible in any Turing complete programming language, as a direct consequence of Kleene's recursion theorem. For amusement, programmers sometimes attempt to develop the shortest possible quine in any given programming language.
The name "quine" was coined by Douglas Hofstadter, in his popular science book ''Gödel, Escher, Bach: An Eternal Golden Braid'', in the honor of philosopher Willard Van Orman Quine (1908–2000), who made an extensive study of indirect self-reference, and in particular for the following paradox-producing expression, known as Quine's paradox:

"Yields falsehood when preceded by its quotation" yields falsehood when preceded by its quotation.

In some languages, particularly scripting languages, an empty source file is a fixed point of the language, being a valid program that produces no output. Such an empty program, submitted as "the world's smallest self reproducing program", once won the "worst abuse of the rules" prize in the International Obfuscated C Code Contest.〔(IOCCC 1994 Worst Abuse of the Rules )〕
==History==
The idea of self-reproducing automata came from the dawn of computing, if not before. John von Neumann himself theorized about them. Later, Paul Bratley and Jean Millo's article "Computer Recreations: Self-Reproducing Automata" discussed them in 1972.
Bratley first became interested in self-reproducing programs after seeing the first known such program written in Atlas Autocode at Edinburgh in the 1960s by the University of Edinburgh lecturer and researcher Hamish Dewar. This program appears below:
%BEGIN
!THIS IS A SELF-REPRODUCING PROGRAM
%ROUTINESPEC R
R
PRINT SYMBOL(39)
R
PRINT SYMBOL(39)
NEWLINE
%CAPTION %END~
%CAPTION %ENDOFPROGRAM~
%ROUTINE R
%PRINTTEXT '
%BEGIN
!THIS IS A SELF-REPRODUCING PROGRAM
%ROUTINESPEC R
R
PRINT SYMBOL(39)
R
PRINT SYMBOL(39)
NEWLINE
%CAPTION %END~
%CAPTION %ENDOFPROGRAM~
%ROUTINE R
%PRINTTEXT '
%END
%ENDOFPROGRAM
The "download source" requirement of the Affero General Public License is based on the idea of a quine.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Quine (computing)」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.